Approximation Algorithms for the Vertex K-Center Problem: Survey and Experimental Evaluation

Approximation Algorithms for the k-center Problem: An Experimental Evaluation

In this paper we deal with the vertex k-center problem, a problem which is a part of the discrete location theory. Informally, given a set of cities, with intercity distances specified, one has to pick k cities and build warehouses in them so as to minimize the maximum distance of any city from its closest warehouse. We examine several approximation algorithms that achieve approximation factor ...

) - Approximation Algorithms for the Asymmetric k � Center Problem Aaron Archer

Given a set V of n points and the distances between each pair, the k-center problem asks us to choose a subset C V of size k that minimizes the maximum over all points of the distance from C to the point. This problem is NPhard even when the distances are symmetric and satisfy the triangle inequality, and Hochbaum and Shmoys gave a best-possible 2-approximation for this case. We consider the ve...

Approximation algorithms for single allocation k-hub center problem

Given a metric graph G = (V,E,w) and a positive integer k, the Single Allocation k-Hub Center problem is to find a spanning subgraph H of G such that (i) C ⊂ V is a clique of size k in H; (ii) V \ C forms an independent set in H; (iii) each v ∈ V \C is adjacent to exactly one vertex in C; and (iv) the diameter D(H) is minimized. The vertices selected in C are called hubs and the rest of vertice...

Capacitated k-Center Problem with Vertex Weights

We study the capacitated k-center problem with vertex weights. It is a generalization of the well known k-center problem. In this variant each vertex has a weight and a capacity. The assignment cost of a vertex to a center is given by the product of the weight of the vertex and its distance to the center. The distances are assumed to form a metric. Each center can only serve as many vertices as...

Improved Approximation Algorithms for the Partial Vertex Cover Problem